1987C - Basil's Garden - CodeForces Solution


greedy

Please click on ads to support us..

Python Code:

def soln():
    n = int(input())
    ht = [int(x) for x in input().split()]
    res = ht[n-1]
    for i in range(n-2, -1, -1):
        res = max(res+1, ht[i])
    return res
    
def main():
    tc = int(input())
    for _ in range(tc):
        ans = soln()
                print(ans)

main()


Comments

Submit
0 Comments
More Questions

1621A - Stable Arrangement of Rooks
472A - Design Tutorial Learn from Math
1368A - C+=
450A - Jzzhu and Children
546A - Soldier and Bananas
32B - Borze
1651B - Prove Him Wrong
381A - Sereja and Dima
41A - Translation
1559A - Mocha and Math
832A - Sasha and Sticks
292B - Network Topology
1339A - Filling Diamonds
910A - The Way to Home
617A - Elephant
48A - Rock-paper-scissors
294A - Shaass and Oskols
1213A - Chips Moving
490A - Team Olympiad
233A - Perfect Permutation
1360A - Minimal Square
467A - George and Accommodation
893C - Rumor
227B - Effective Approach
1534B - Histogram Ugliness
1611B - Team Composition Programmers and Mathematicians
110A - Nearly Lucky Number
1220B - Multiplication Table
1644A - Doors and Keys
1644B - Anti-Fibonacci Permutation